Approximating the Minimum Breakpoint Linearization Problem for Genetic Maps without Gene Strandedness
نویسنده
چکیده
The study of genetic map linearization leads to a combinatorial hard problem, called the minimum breakpoint linearization (MBL) problem. It is aimed at finding a linearization of a partial order which attains the minimum breakpoint distance to a reference total order. The approximation algorithms previously developed for the MBL problem are only applicable to genetic maps in which genes or markers are represented as signed integers. However, current genetic mapping techniques generally do not specify gene strandedness so that genes can only be represented as unsigned integers. In this paper, we study the MBL problem in the latter more realistic case. An approximation algorithm is thus developed, which achieves a ratio of (m2 + 2m − 1) and runs in O(n7) time, where m is the number of genetic maps used to construct the input partial order and n the total number of distinct genes in these maps. Index terms — Comparative genomics, partial order, breakpoint distance, feedback vertex set.
منابع مشابه
Revisiting the Minimum Breakpoint Linearization Problem
The gene order on a chromosome is a necessary data for most comparative genomics studies, but in many cases only partial orders can be obtained by current genetic mapping techniques. The Minimum Breakpoint Linearization Problem aims at constructing a total order from this partial knowledge, such that the breakpoint distance to a reference genome is minimized. In this paper, we first expose a fl...
متن کاملInferring Gene Orders from Gene Maps Using the Breakpoint Distance
Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usually give rise to different maps with unequal gene content, and often containing sets of unordered neighboring genes. Only partial orders can thus be obtained from combining such maps. However, once a total order O is known for a...
متن کاملGene Maps Linearization Using Genomic Rearrangement Distances
A preliminary step to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Different genetic mapping techniques often give rise to different maps with unequal gene content and sets of unordered neighboring genes. Only partial orders can thus be obtained from combining such maps. However, once a total order O is known for a given genome, it can be use...
متن کاملOn Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gene strandedness information. In this paper we show it is a NP-hard problem by reduction to an equivalent previously-known problem, called breakpoint graph decomposition (BGD), which calls for a largest collection of ed...
متن کاملCorrelation of Minimum Inhibitory Concentration Breakpoints and Methicillin Resistance Gene Carriage in Clinical Isolates of Staphylococcus epidermidis
Staphylococcus epidermidis is the most important member of coagulase negative staphylococci responsible for community and hospital acquired infections. Most clinical isolates of S. epidermidis are resistant to methicillin making these infections difficult to treat. In this study, correlation of methicillin resistance phenotype was compared with methicillin resistance (mecA) gene carriage in 55 ...
متن کامل